An Algorithm Which Generates the Hamiltonian Circuits of a Cubic Planar Map
نویسنده
چکیده
The paper describes an algorithm which generates those Hamiltonian circuits of a given cubic planar map which include some chosen edge of the map. A simple extension of the method results in the generation of all the Hamiltonian circuits of the map. The algorithm can readily be implemented on a digital computer, subject to limitations on storage. A general property of the generating function defined by the algorithm leads to a proof th¥t the total number of Hamiltonian circuits which include any given edge of a cubic planar map is even. Does the structure of the function yield further information concerning the properties of the family of Hamiltonian circuits?
منابع مشابه
New results on hypohamiltonian and almost hypohamiltonian graphs
Consider a non-hamiltonian graph G. G is hypohamiltonian if for every vertex v in G, the graph G − v is hamiltonian. G is almost hypohamiltonian if there exists a vertex w in G such that G−w is non-hamiltonian, and G− v is hamiltonian for every vertex v 6= w. McKay asked in [J. Graph Theory, doi: 10.1002/jgt.22043] whether infinitely many planar cubic hypohamiltonian graphs of girth 5 exist. We...
متن کاملBASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملQuantum Computing Hamiltonian Cycles
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths initiating from a chosen vertex, and furthermore to subsequently project out all states not corresponding to Hamiltonian cycles. A Hamiltonian cycle is a pat...
متن کاملOptimization of Quantum Cellular Automata Circuits by Genetic Algorithm
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
متن کاملNote on Petrie and Hamiltonian cycles in cubic polyhedral graphs
In this note we show that deciding the existence of a Hamiltonian cycle in a cubic plane graph is equivalent to the problem of the existence of an associated cubic plane multi-3-gonal graph with a Hamiltonian cycle which takes alternately left and right edges at each successive vertex, i.e. it is also a Petrie cycle. The Petrie Hamiltonian cycle in an n-vertex plane cubic graph can be recognize...
متن کامل